Self-stabilizing ℓ-exclusion

Tight Space Self-Stabilizing Uniform l-Mutual Exclusion

Self-Stabilizing k-out-of-l exclusion on tree networks

In this paper, we address the problem of k-out-of-l Exclusion, a generalization of the mutual exclusion problem, in which there are l units of a shared resource, and any process can request up to k units (1 ≤ k ≤ l). We propose the first deterministic self-stabilizing distributed k-out-of-l Exclusion protocol in message-passing systems for asynchronous oriented tree networks which assumes bound...

Self-stabilizing K-out-of-L exclusion on tree network

In this paper, we address the problem of k-out-of-l exclusion, a generalization of the mutual exclusion problem, in which there are l units of a shared resource, and any process can request up to k units (1 ≤ k ≤ l). We propose the first deterministic self-stabilizing distributed k-out-of-l exclusion protocol in message-passing systems for asynchronous oriented tree networks which assumes bound...

Self-Stabilizing -out-of- Exclusion

In this paper, self-stabilizing asynchronous distributed algorithms are given for the -out-ofexclusion problem, a generalization of the mutual exclusion problem, in which there are units of a resource, and any process can request up to units. We consider two network topologies, a tree and a unidirectional ring. The networks are anonymous except for one distinguished process. The ring algorithm ...

Verifying a Self - Stabilizing Mutual Exclusion

We present a detailed description of a machine-assisted veriication of an algorithm for self-stabilizing mutual exclusion that is due to Dijkstra Dij74]. This veriication was constructed using PVS. We compare the mechanical veriication to the informal proof sketch on which it is based. This comparison yields several observations regarding the challenges of formalizing and mechanically verifying...